An axiomatization of minimal curb sets
نویسندگان
چکیده
Norde et al. [Games Econ. Behav. 12 (1996) 219] proved that none of the equilibrium concepts in the literature on equilibrium selection in finite strategic games satisfying existence is consistent. A transition to set-valued solution concepts overcomes the inconsistency problem: there is a multiplicity of consistent set-valued solution concepts that satisfy nonemptiness and recommend utility maximization in one-player games. The minimal curb sets of Basu and Weibull [Econ. Letters 36 (1991) 141] constitute one such solution concept; this solution concept is axiomatized in this article. JEL classification: C72
منابع مشابه
Algorithms for Closed Under Rational Behavior (CURB) Sets
We provide a series of algorithms demonstrating that solutions according to the fundamental game-theoretic solution concept of closed under rational behavior (CURB) sets in two-player, normal-form games can be computed in polynomial time (we also discuss extensions to n-player games). First, we describe an algorithm that identifies all of a player’s best responses conditioned on the belief that...
متن کاملStrongly Rational Sets for Normal-Form Games
Curb sets [Basu and Weibull, Econ. Letters 36 (1991), 141-146] are product sets of pure strategies containing all individual best-responses against beliefs restricted to the recommendations to the remaining players. The concept of minimal curb sets is a set-theoretic coarsening of the notion of strict Nash equilibrium. We introduce the concept of minimal strong curb sets which is a set-theoreti...
متن کاملOn finding curb sets in extensive games
We characterize strategy sets that are closed under rational behavior (curb) in extensive games of perfect information and finite horizon. It is shown that any such game possesses only one minimal curb set, which necessarily includes all its subgame perfect Nash equilibria. Applications of this result are twofold. First, it lessens computational burden while computing minimal curb sets. Second,...
متن کاملLearning by Adaptive and Forward-Looking Players with One Period Memory
We investigate how much simple-minded players with one period memory can learn for general stage games. The adaptive and one-step forward-looking behavior rules are sufficient for convergence to a minimal weak curb set. Weak curb sets are in general larger than the curb sets but the minimal ones coincide for many games including weakly acyclic games and supermodular games. We also provide an ex...
متن کاملEpistemically Stable Strategy Sets
This paper provides a definition of epistemic stability of sets of strategy profiles, and uses it to characterize variants of curb sets in finite games, including the set of rationalizable strategies and minimal curb sets.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Int. J. Game Theory
دوره 34 شماره
صفحات -
تاریخ انتشار 2005